Grammar Systems as Language Analyzers and Recursively Enumerable Languages
نویسندگان
چکیده
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on its own sentential form, and communication steps, where a transfer of sentential forms is done. We discuss accepting and analyzing versions of such grammar systems with context-free productions and present characterizations of the family of recursively enumerable languages by them. In accepting parallel communicating grammar systems rules of the form ! A with a word and a nonterminal A are applied as in the generating case, and the language consists of all terminal words which can derive the axiom. We prove that all types of these accepting grammar systems describe the family of recursively enumerable languages, even if-rules are forbidden. Moreover, we study analyzing parallel communicating grammar systems, the derivations of which perform the generating counterparts backwards. This requires a modiication of the generating derivation concept to strong-returning parallel communicating grammar systems which also generate the family of recursively enumerable languages.
منابع مشابه
PC grammar systems with five context-free components generate all recursively enumerable languages
متن کامل
2-Testability and Relabelings Produce Everything
We show that grammar systems with communication by command and with extremely simple rewriting rules (in fact, only relabelings are needed) are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems. We also present the result in a general framework, without referring to grammar systems, obtaining a characterization of recu...
متن کاملControlled Pure Grammar Systems
This paper discusses grammar systems that have only terminals, work in the leftmost way, and generate their languages under the regulation by control languages over rule labels. It establishes three results concerning their generative power. First, without any control languages, these systems are not even able to generate all context-free languages. Second, with regular control languages, these...
متن کاملOn enhanced time-varying distributed H systems
An enhanced time-varying distributed H system (ETVDH system) is a slightly different definition of the time-varying distributed H system (TVDH system) [9] and it was proposed by M. Margenstern and Yu. Rogozhin in [4] under the name of “extended time-varying distributed H system”. The main difference is that the components of the ETVDH system are H systems and therefore splicing rules may be app...
متن کاملComputational Complexity and Lexical Funtional Grammar
An important goal of modern linguistic theory is to characterize as narrowly as possible the class of natural languages. One classical approach to this characterization has been to investigate the generative capacity of grammatical systems specifiable within particular linguistic theories. Formal results along these lines have already been obtained for certain kinds of Transformational Generat ...
متن کامل